Inverse Pattern Matching
نویسندگان
چکیده
Let a textstring T of n symbols from some alphabet E and an integer m < n be given. A pattern P of length mover E is sought such that P minimizes (alternatively, maximizes) the total number of pairwise character mismatches generated when P is compared with all mcharacter substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be (respectively, not be) a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملExternal Inverse Pattern Matching
In this paper we consider the externa//nverse pattern match/ng problem. Given a text T of length n over an ordered alphabet ,U and a number m <_ n, the goal is to find a pattern ~-~MAX ~ ~rn which is not a subword of T and which maximizes the sum of Hamming distances between ~MAX and all subwords of T of length m. We present an optimal O(nloga)-time (where a = 1/71) algorithm for the external i...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...
متن کاملThe Universal Resolving Algorithm: Inverse Computation in a Functional Language
R. Backhouse and J. N. Oliveira (Eds.): Mathematics of Program Construction. Proceedings. LNCS 1837, pp. 187–212, 2000. c © Springer-Verlag Berlin Heidelberg 2000 Abstract. We present an algorithm for inverse computation in a firstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) introduced in this paper is sound and complete, and c...
متن کاملVisual alignment robot system: Kinematics, pattern recognition, and control
The visual alignment robot system for display and semiconductor fabrication process largely consists of multiaxes precision stage and vision peripherals. One of the central issues in a display or semiconductor mass production line is how to reduce the overall tact time by making a progress in the alignment technology between the mask and panel. In this paper, we suggest the kinematics of the 4P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 24 شماره
صفحات -
تاریخ انتشار 1997